A generalized Mobius transform and arithmetic Fourier transforms
نویسندگان
چکیده
منابع مشابه
A generalized Mobius transform and arithmetic Fourier transforms
A general approach to arithmetic Fourier transforms is developed. The implementation is based on the concept of killer polynomials and the solution of an arithmetic deconvolution problem pertaining to a generalized Mobius transform. This results in an extension of the Bruns procedure, valid for all prime numbers, and in an AFT that extracts directly the sine coefficients from the Fourier series.
متن کاملA generalized Mobius transform, arithmetic Fourier transforms, and primitive roots
A general approach to arithmetic Fourier transforms is developed. The implementation is based on sine and cosine killer procedures pertaining to a generalized Möbius transform involving reduced periodic multiplicative arithmetical functions. It is shown that cosine killer procedures exist whenever one half of Euler’s totient function of the order of the transform is odd. Primitive roots and ind...
متن کاملSparse Generalized Fourier Transforms ∗
Block-diagonalization of sparse equivariant discretization matrices is studied. Such matrices typically arise when partial differential equations that evolve in symmetric geometries are discretized via the finite element method or via finite differences. By considering sparse equivariant matrices as equivariant graphs, we identify a condition for when block-diagonalization via a sparse variant ...
متن کاملGeneralized Fourier Transforms of Distributions
In [1], R. A. Kunze has presented a notion of generalized Fourier transform of functions on locally compact abelian groups. The point of this paper is to extend this idea in the direction of distribution theory and to present some initial results on this generalized Fourier transform of distributions. In a later paper we hope to investigate in detail the domain, range, and kernel of this transf...
متن کاملFourier Transforms and the Fast Fourier Transform ( FFT ) Algorithm
and the inverse Fourier transform is f (x) = 1 2π ∫ ∞ −∞ F(ω)e dω Recall that i = √−1 and eiθ = cos θ+ i sin θ. Think of it as a transformation into a different set of basis functions. The Fourier transform uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 1994
ISSN: 1053-587X
DOI: 10.1109/78.330357